TAG Derivation as Monotonie C-Command*

نویسندگان

  • K. Vijay-Shanker
  • Robert Frank
چکیده

The TAG adjunction operation operates by splitting a tree at one node, which we will call the adjunction site. In the resulting structure, the subtrees above and below the adjunction site are separated by, and connected with, the auxiliary tree used in the composition. As the adjunction site is thus split into two nodes, with a copy in each subtree, a natural way of formalizing the adjunction operation posits that each potential adjunction site is in fact represented by two distinct nodes. In the FTAG formalism (Vijay-Shanker, 1988) each potential adjunction site is associated with two feature structures, one for each copy. As an alternative to this operationally defined rewriting view of adjunction, Vijay-Shanker (1992) suggests that TAG derivations instead be viewed as a monotonic growth of structural assertions that characterize the structures being composed. This proposal rests crucially on the a.cisumption that the elementary trees are characterized in terms of a domination relation among nodes, and that each potential adjunction . site is represented by two nodes standing in a domination relation. Under th.is proposal, the structures a and ß in Figure 1 would be used to derive long-distance wh-movement. To adjoin ß into a, the root and foot nodes of ß are identified with the two C nodes standing in a domination relation in a (represented by the dotted line). This domination relation still holds after adjunction, as do all the other domination relations stated in defining a and ß. (In sentences in which there is no adjoining at the C' node, e.g., 'I wonder what Mary saw,' these C' nodes could collapse, preserving domination under the assumption that it is a reflexive relation.) Domination has also been argued to play a role in multi-component structures, where there is assumed to be a domination relationship between a frontier node of one cornponent and the root of the other. While the use of domination relationships is attractive in allowing us to view TAG derivations as

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonic C-Command: A New Perspective on Tree Adjoining Grammar

In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the combinatory operation is substitution. We show how the formalism we sketch resolves a number of problems for TAG that have been identified in the literature. Additionally, we demonstrate that our proposal is preferable...

متن کامل

C-Command and Extraction in Tree Adjoining Grammar

A number of problems for the Tree Adjoining Grammar (TAG) formalism have been identi-ed in the literature. In this paper we argue for a reconceptualization of the TAG formalism, in which the elementary structures are collections of c-command relations, and the combina-tory operation is substitution. We demonstrate how the formalism we sketch, though similar in certain respects to D-tree grammar...

متن کامل

One More Perspective on Semantic Relations in TAG

It has often been noted that the derivation trees of “standard” TAG grammars for natural languages (Group, 1998) resemble semantic dependency trees (Mel’ĉuk, 1988). More interesting, from a formal perspective, are the ways in which the derivation trees and the dependency trees diverge for certain problematic constructions. The desire to fix these cases has led to a variety of proposals for modi...

متن کامل

A Characterization Theorem for the Discrete Best Monotonic Approximation Problem

A characterization theorem is derived that motivates a procedure for generating discrete best monotonie approximations to n sequential data values, when a strictly convex objective function is used in the calculation. The procedure is highly useful in the discrete nonlinear optimization calculation that produces the best piecewise monotonie approximations to the data.

متن کامل

Gapping through TAG derivation trees

This work provides a TAG account of gapping in English, based on a novel deletion-like operation that is referred to as de-anchoring. De-anchoring applies onto elementary trees, but it is licensed by the derivation tree in two ways. Firstly, de-anchored trees must be linked to the root of the derivation tree by a chain of adjunctions , and the sub-graph of de-anchored nodes in a derivation tree...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016